Fractional Bio-Image Encryption using Karhunen-Loeve Transform

نویسندگان

  • T. Sivakumar
  • R. Venkatesan
  • Hongjun Liu
  • Xingyuan Wang
  • Abdurahman kadir
  • Ismet Ozturk
  • Ibrahim Sogukpinar
  • Mohammad Ali Bani Younes
  • Aman Jantan
  • Nooshin Bigdeli
  • Yousef
  • Farid
  • Karim Afshar
  • Seyed Mohammad Seyedzadeh
  • Tzung-Her Chen
  • Kuang-Che Li
  • Sapna Sasidharan
چکیده

Bio-images such as fingerprint, face and iris are sensitive and hence small change in such images could affect the result substantially. The processing overhead could be reduced by encrypting a preferred region instead of encrypting the entire image. In this paper a novel fractional bio-image encryption method is presented using Karhunen-Loeve (KL) transform, which is a reversible linear transform. The original image (x) is given as input to cropping function to identify and extract the region to be encrypted. Next, the extracted region, in the form of square, is given as input to the KL transform which in turn produces the cipher image (y) and the inverse transform key (T). The encrypted region is combined with the original image to get the partial cipher image. Since the inverse transform key (T) plays a major role for decryption, it could be given to the receiver by encrypting with symmetric key cryptosystem. On receiving the partial encrypted image (y) the receiver identify and extract the encrypted region and apply the inverse of KL transform using the inverse key (T). The result is merged with the received image to get the original image (x). The histograms of the encrypted portion of the images are nearly uniform and different from the histogram of original images. This method of fractional bio-image cryptosystem will reduce the overhead of encryption and decryption processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Framework for Image Encryption using Karhunen-Loeve Transform

The Karhunen-Loeve (KL) transform is widely used technique for image compression or clustering analysis. Since KL transform is a reversible linear transform, a novel cryptosystem is developed to provide confidentiality service for images. The original image (x), in the form of square matrix, is given as input to the KL transform which in turn produces the encrypted image (y) and the decryption ...

متن کامل

Compression of image clusters using Karhunen Loeve transformations

This paper proposes to extend the Karhunen-Loeve compression algorithm to multiple images. The resulting algorithm is compared against single-image Karhunen Loeve as well as algorithms based on the Discrete Cosine Transformation (DCT). Futhermore, various methods for obtaining compressable clusters from large image databases are evaluated.

متن کامل

Comparison of Image Approximation Methods: Fourier Transform, Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform

In this paper we compare the performance of several transform coding methods, Discrete Fourier Transform, Discrete Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform, commonly used in image compression systems through experiments. These methods are compared for the effectiveness as measured by rate-distortion ratio and the complexity of computation.

متن کامل

Image Steganography using Karhunen-Loeve Transform and Least Bit Substitution

As communication channels are increasing in number, reliability of faithful communication is reducing. Hacking and tempering of data are two major issues for which security should be provided by channel. This raises the importance of steganography. In this paper, a novel method to encode the message information inside a carrier image has been described. It uses Karhunen-Loève Transform for comp...

متن کامل

Use of Fourier and Karhunen-Loeve Decomposition for Fast Pattern Matching With a Large Set of Templates

We present a fast pattern matching algorithm with a large set of templates. The algorithm is based on the typical template matching speeded up by the dual decomposition; the Fourier transform and the Karhunen-Loeve transform. The proposed algorithm is appropriate for the search of an object with unknown distortion within a short period. Patterns with different distortion differ slightly from ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013